Global optimization of multistage binary separation networks
نویسندگان
چکیده
منابع مشابه
Nanoscale heterogeneous phase separation kinetics in binary mixtures: Multistage dynamics
In order to find a measure of the dynamical features of phase separation kinetics during spinodal decomposition of a liquid binary mixture (like water and cyclohexane , water and 2,6 lutidiene or methanol and cyclohexane), we study both the initial fast exponential-like growth (the Cahn-Hilliard regime) and the subsequent cross-over to a much slower, non-exponential long time growth (the so-cal...
متن کاملMultistage vector quantizer optimization for packet networks
A multistage vector quantizer (MSVQ) based coding system is source-channel optimized for packet networks. Resilience to packet loss is enhanced by a proposed interleaving approach that ensures that a single lost packet only eliminates a subset of the vector stages. The design is optimized while taking into account compression efficiency, packet loss rate, and the interleaving technique in use. ...
متن کاملBinary decision rules for multistage adaptive mixed-integer optimization
Decision rules provide a flexible toolbox for solving the computationally demanding, multistage adaptive optimization problems. There is a plethora of real-valued decision rules that are highly scalable and achieve good quality solutions. On the other hand, existing binary decision rule structures tend to produce good quality solutions at the expense of limited scalability, and are typically co...
متن کاملGlobal Optimization of RBF Networks
Several modifications to parameter estimation in a Radial Basis Functions network are introduced. These include a better initializing clustering algorithm and a full gradient descent on centers and weights after weights were found via a matrix inversion. Performance comparison with other RBF algorithms is given on several data-sets. It is found that The proposed method was found superior to Bis...
متن کاملAdjustable Robust Multistage Optimization
Format (5.1.1) covers all uncertain optimization problems considered so far; moreover, in these latter problems the objective f and the right hand side F of the constraints always were bi-affine in x, ζ, (that is, affine in x when ζ is fixed, and affine in ζ, x being fixed), and K was a “simple” convex cone (a direct product of nonnegative rays/Lorentz cones/Semidefinite cones, depending on whe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chemical Engineering and Processing - Process Intensification
سال: 2018
ISSN: 0255-2701
DOI: 10.1016/j.cep.2018.06.024